Characterizations of strong unicity in approximation theory
نویسندگان
چکیده
منابع مشابه
Effective bounds on strong unicity in L1-approximation
In this paper we present another case study in the general project of Proof Mining which means the logical analysis of prima facie non-effective proofs with the aim of extracting new computationally relevant data. We use techniques based on monotone functional interpretation (developed in [18]) to analyze Cheney’s simplification [6] of Jackson’s original proof [10] from 1921 of the uniqueness o...
متن کاملUnicity Subspaces in L ’ - Approximation
In 1918 A. Haar [4] characterized those n-dimensional subspaces U, of C[O, l] for which there exists a unique best approximation to every realvalued function f E C[O, l] in the uniform (L”) norm. Haar proved that uniqueness always holds if and only if U, is a Tchebycheff (T-) system on [0, 11, or what is sometimes referred to as a Haar system (or Haar space). This simply means that no u E U,\ {...
متن کاملStrong unicity criterion in some space of operators
Let X be a finite dimensional Banach space and let Y ⊂ X be a hyperplane. Let L Y = {L ∈ L (X, Y ) : L |Y = 0}. In this note, we present sufficient and necessary conditions on L0 ∈ L Y being a strongly unique best approximation for given L ∈ L (X). Next we apply this characterization to the case of X = l ∞ and to generalization of Theorem I.1.3 from [12] (see also [13]).
متن کاملNew effective moduli of uniqueness and uniform a–priori estimates for constants of strong unicity by logical analysis of known proofs in best approximation theory
Let U and V be complete separable metric spaces, Vu compact in V and G : U × V → IR a continuous function. For a large class of (usually non–constructive) proofs of uniqueness theorems ∧ u ∈ U, v1, v2 ∈ Vu ( G(u, v1) = inf v∈Vu G(u, v) = G(u, v2) → v1 = v2 ) one can extract an effective modulus of uniqueness Φ by logical analysis, i.e. ∧ u ∈ U, v1, v2 ∈ Vu, n ∈ IN ( 2 ∧ i=1 ( G(u, vi)− inf v∈Vu...
متن کاملUnicity in piecewise polynomial L1-approximation via an algorithm
Our main result shows that certain generalized convex functions on a real interval possess a unique best L1 approximation from the family of piecewise polynomial functions of fixed degree with varying knots. This result was anticipated by Kioustelidis in [11]; however the proof given there is nonconstructive and uses topological degree as the primary tool, in a fashion similar to the proof the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 1973
ISSN: 0021-9045
DOI: 10.1016/0021-9045(73)90091-9